Delphi: Predition-based Page Prefetching to Improve the Performance of Shared Virtual Memory Systems
نویسندگان
چکیده
Software distributed shared memory (SDSM) systems traditionally exhibit poor performance on applications with significant fine-grain or false sharing. Techniques such as relaxedconsistency models and multiple -writers protocols improve the performance of SDSM systems significantly, but their performance still lags that of hardware shared memory implementations. This paper describes Delphi, a system that borrows techniques from microarchitectural research on value prediction and applies them to software distributed shared memory. We run a small software predictor on each node in the Delphi system to predict which virtual pages will be needed in the future. We use the predictions to prefetch pages in order to reduce the number of accesses to invalid data and thereby reduce expensive network accesses. Experimental results show that Delphi is able to reduce the number of read misses to virtual pages by up to 62% on a set of well-known scientific benchmarks with minimal runtime overhead in extra processing and memory requirements. This translates into a 14% reduction in execution time over a comparable base system that does not employ prediction techniques.
منابع مشابه
Esodyp+: Prefetching in the Jackal Software DSM
Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a novel prefetching technique for object-based Distributed Shared Memory (DSM) systems and discuss its implementation. In contrast to page-based DSMs, an object-based DSM distributes data on the level of objects, rendering curren...
متن کاملEffectivness of Dynamic Prefetching in Multiple-Writer Distributed Virtual Shared-Memory Systems
We consider a network of workstations (NOW) organization consisting of busbased multiprocessors interconnected by an ATM interconnect on which a sharedmemory programming model is imposed by using a multiple-writer distributed virtual shared memory system. The latencies associated with bringing data into the local memory are a severe performance limitation of such systems. To tolerate the access...
متن کاملEffectiveness of Dynamic Prefetching in Multiple-WriterDistributed Virtual Shared Memory Systems
We consider a network of workstations (NOW) organization consisting of busbased multiprocessors interconnected by an ATM interconnect on which a sharedmemory programming model is imposed by using a multiple-writer distributed virtual shared memory system. The latencies associated with bringing data into the local memory are a severe performance limitation of such systems. To tolerate the access...
متن کاملAdaptive Prefetching Technique for Shared Virtual Memory
Though shared virtual memory (SVM) systems promise low cost solutions for high performance computing, they suffer from long memory latencies. These latencies are usually caused by repetitive invalidations on shared data. Since shared data are accessed through synchronizations and the patterns by which threads synchronizes are repetitive, a prefetching scheme based on such repetitiveness would r...
متن کاملPage Fault Behavior and Prefetching in Software DSMs
Prefetching strategies can conceivably be used to reduce the high remote data access laten-cies of software-only distributed shared-memory systems (DSMs). However, in order to design eeective prefetching techniques, one must understand the page fault behavior of parallel applications running on top of these systems. In this paper we study this behavior according to its spatial, temporal, and sh...
متن کامل